Wander types : A formalization of coinduction-recursion
نویسندگان
چکیده
منابع مشابه
Wander types : A formalization of coinduction - recursion ∗
Wander types are a coinductive version of inductive-recursive definitions. They are defined by simultaneously specifying the constructors of the type and a function on the type itself. The types of the constructors can refer to the function component and the function itself is given by pattern matching on the constructors. Wander types are different from inductive-recursive types in two ways: t...
متن کاملWander Types A Formalization of Coinduction - Recursion ∗
Wander types are a coinductive version of inductive-recursive definitions. They are defined by simultaneously specifying the constructors of the type and a function on the type itself. The types of the constructors can refer to the function component and the function itself is given by pattern matching on the constructors. Wander types are different from inductive-recursive types in two ways: t...
متن کاملCompositional Coinduction with Sized Types
Proofs by induction on some inductively defined structure, e. g., finitely-branching trees, may appeal to the induction hypothesis at any point in the proof, provided the induction hypothesis is only used for immediate substructures, e. g., the subtrees of the node we are currently considering in the proof. The basic principle of structural induction can be relaxed to course-of-value induction,...
متن کاملA Coinduction Principle for Recursive Data Types Based on Bisimulation
Synopsis The concept of bisimulation from concurrency theory Par81, Mil89] is used to reason about recursively deened data types. From two strong-extensionality theorems stating that the equality (resp. inequality) relation is maximal among all bisimulations, a proof principle for the nal coalgebra of an endofunctor on a category of data types (resp. domains) is obtained. As an application of t...
متن کاملGeneral recursion via coinductive types
A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations, implementation of operational semantics, formalization of domain theory, and inductive definition of domain predicates. Here, a different solution is proposed: exploiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress in Informatics
سال: 2013
ISSN: 1349-8614,1349-8606
DOI: 10.2201/niipi.2013.10.4